The Role of Parameterized Computational Complexity Theory inCognitive Modeling
نویسنده
چکیده
This paper shows how parameterized computational complexity theory is better than previously-used theories of computational complexity , e.g., NP-completeness, at both measuring the power of computational models of cog-nitive systems and isolating the sources of this power. This point is illustrated with new param-eterized analyses of two current constraint-based models in linguistics, Declarative Phonology and Optimality Theory.
منابع مشابه
On Parameterized Intractability: Hardness and Completeness
We study the theory and techniques developed in the research of parameterized intractability, emphasizing on parameterized hardness and completeness that imply (stronger) computational lower bounds for natural computational problems. Moreover, the fundamentals of the structural properties in parameterized complexity theory, relationships to classical complexity theory and more recent developmen...
متن کاملSome Lower Bounds in Parameterized AC^0
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC0. Among others, we derive such a lower bound for all fptapproximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the fir...
متن کاملA Proof Checking View of Parameterized Complexity
The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure of computational problems. As a surprising side-effect, it also gives strong nonapproximability results. In this paper we initiate the study of proof checking within the scope of Parameterized Complexity. In particul...
متن کاملStructural Parameterized Complexity
We revisit fixed-parameter tractability, fixed-parameter reducibility and kernelizability. The standard formulations of their definitions are enhanced for greater correctness from a structural complexity point of view. Doing so makes clear the distinction between fixed-parameter reducibility and kernelizability. Additionally, these time based definitions are augmented with space based counterpa...
متن کاملSparse Parameterized Problems
Sparse languages play an important role in classical structural complexity theory. In this paper we introduce a natural definition of sparse problems for parameterized complexity theory. We prove an analog of Mahaney’s theorem: there is no sparse parameterized problem which is hard for the tth level of the W hierarchy, unless the W hierarchy itself collapses up to level t. The main result is pr...
متن کامل